<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    387. First Unique Character in a String
   </h1>
   <p>
    Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
   </p>
   <p>
    <b>
     Examples:
    </b>
   </p>
   <pre>
s = "leetcode"
return 0.

s = "loveleetcode",
return 2.
</pre>
   <p>
    <b>
     Note:
    </b>
    You may assume the string contain only lowercase letters.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    387. 字符串中的第一个唯一字符
   </h1>
   <p>
    给定一个字符串，找到它的第一个不重复的字符，并返回它的索引。如果不存在，则返回 -1。
   </p>
   <p>
    <strong>
     案例:
    </strong>
   </p>
   <pre>
s = "leetcode"
返回 0.

s = "loveleetcode",
返回 2.
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     注意事项：
    </strong>
    您可以假定该字符串只包含小写字母。
   </p>
  </div>
 </body>
</html>